Brief Announcement: Self-stabilizing Spanning Tree Algorithm for Large Scale Systems
نویسندگان
چکیده
We introduce a self-stabilizing algorithm that builds and maintains a spanning tree topology on any large scale system. We assume that the existing topology is a complete graph and that nodes may arrive or leave at any time. To cope with the large number of processes of a grid or a peer to peer system, we limit the memory usage of each process to a small constant number of variables, combining this with previous results concerning failure detectors and resource discovery. We provide a formal proof of the algorithm and the results of experiments on a cluster.
منابع مشابه
Self-Stabilizing Spanning Tree Algorithm for Large Scale Systems
We introduce a self-stabilizing algorithm that builds and maintains a spanning tree topology on any large scale system. We assume that the existing topology is a complete graph and that nodes may arrive or leave at any time. To cope with the large number of processes of a grid or a peer to peer system, we limit the memory usage of each process to a small constant number of variables, combining ...
متن کاملBrief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network
Given a network of processes G, where each process has a fixed input bit , Input(x), the disjunction problem is for each process to compute Output = ∨ x∈G Input(x), the disjunction of all input bits in the network. A distributed solution to the disjunction problem is a distributed algorithm which computes an output bit for each process, such that all output bits are equal to Output. The solutio...
متن کاملSelf-Stabilizing Distributed File Systems
A self-stabilizing distributed file system is presented. The system constructs and maintains a spanning tree for each file volume. The spanning tree consists of the servers that have volume replicas and caches for the specific file volume. The spanning trees are constructed and maintained by selfstabilizing distributed algorithms. File system updates use the tree to implement file read and writ...
متن کاملA Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem
Self-stabilization is a theoretical framework of nonmasking fault-tolerant distributed algorithms. In this paper, we investigate the Steiner tree problem in distributed systems, and propose a selfstabilizing heuristic solution to the problem. Our algorithm is constructed by four layered modules (sub-algorithms): construction of a shortest path forest, transformation of the network, construction...
متن کاملComputer Science Technical Report A Self-Stabilizing Distributed Algorithm to Construct An Arbitrary Spanning Tree of a Connected Graph
We propose a simple self-stabilizing distributed algorithm that maintains an arbitrary spanning tree in a connected graph. In proving the correctness of the algorithm we develop a new technique without using a bounded function (which is customary for proving correctness of self-stabilizing algorithms); the new approach is simple and can be potentially applied to proving correctness of other sel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006